The poset structures admitting the extended binary Hamming code to be a perfect code
نویسندگان
چکیده
منابع مشابه
The poset structures admitting the extended binary Hamming code to be a perfect code
Brualdi et al. introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Hamming code to be a double-error-correcting perfect P-code. Our study is motivated by this example. In this paper we classify all poset structures which admit the extended binary Hamming code to be a double or triple-error-correcting perfect P-code. © 2004 Elsevier B.V....
متن کاملThe poset structures admitting the extended binary Golay code to be a perfect code
Brualdi et al. [Codes with a poset metric, Discrete Math. 147 (1995) 57–72] introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Golay code to be a 4-error-correcting perfect P-code. In this paper we classify all of the poset structures which admit the extended binary Golay code to be a 4-error-correcting perfect P-code, and show that th...
متن کاملOn the extention of propelinear structures of Nordstrom-Robinson code to Hamming code
A code is called propelinear if its automorphism group contains a subgroup that acts regularly on its codewords, which is called a propelinear structure on the code. In the paper a classification of the propelinear structures on the Nordstrom-Robinson code is obtained and the question of extension of these structures to propelinear structures of the Hamming code, that contains the Nordstrom-Rob...
متن کاملConstructing the Extended Binary Golay Code
Coding theory is the subject which is concerned with how information can be sent over a noisy channel. A code then is a collection of codewords which are strings of a fixed number of letters from an alphabet. Some of these strings are codewords others are not. When a codeword is sent over a channel there is a probability less than /2 that each letter in the codeword will be changed, thus introd...
متن کاملEven poset and a parity result for binary linear code
Let C be a linear binary code, namely a subspace of the space consisting of all binary vectors of a fixed length. A vector in C is maximal provided it has a maximal support among C; a nonzero vector in C is minimal provided it has a minimal support among C \ {0}. We prove that the sum of all maximal vectors of C equals the sum of all minimal vectors of C. In course of this research, we introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.07.010